D1 chapter 7 - matchings

Bipartite graphs and matchings

Sections

D1 section 7.1


Prerequisites:
  • recall the definition of a bipartite graph
  • recall the meaning of the notation Ki,j
Learning objectives: WALT
  • model matching problems with bipartite graphs
  • use matching improvement algorithms
Examples:
  • Allocation of teaching units to maths staff. Certain colleagues have certain preferences for teaching A-level maths units. These preferences are indicated in the table below:
teacher*
A-level units offered
Mr Andrews
C1, C2, M1
Miss Brown
C1, S1, S2
Mrs Collins
C3, C4
Mr Davies
C1, C2, M1
Mr Ericson
C3, D1
Ms Fields
S1, D1, D2
  • names have been changed!

D1 Exercise 7A

  • D1 Exercise 7A worked solutions:
  • Questions similar to this exercise:

D1 section 7.2